Minimum distances of error-correcting codes in incidence rings
نویسندگان
چکیده
منابع مشابه
Minimum Distances of Error-correcting Codes in Incidence Rings
It is very well known that additional algebraic structure can give advantages for coding applications. For example, all cyclic error-correcting codes are principal ideals in the group algebras of cyclic groups (see the survey [4] and the books [3, 5, 6, 7]). Serious attention in the literature has been devoted to considering properties of ideals in various ring constructions essential from the ...
متن کاملDirected Graphs and Minimum Distances of Error–correcting Codes in Matrix Rings
The main theorems of this paper give sharp upper bounds for the minimum distances of one-sided ideals in structural matrix rings defined by directed graphs. It is very well known that additional algebraic structure can give advantages for coding applications (see, for example, [8]). Serious attention in the literature has been devoted to considering properties of ideals in various ring construc...
متن کاملRandom codes: Minimum distances and error exponents
Minimum distances, distance distributions, and error exponents on a binary-symmetric channel (BSC) are given for typical codes from Shannon’s random code ensemble and for typical codes from a random linear code ensemble. A typical random code of length and rate is shown to have minimum distance (2 ), where ( ) is the Gilbert–Varshamov (GV) relative distance at rate , whereas a typical linear co...
متن کاملOne-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes
We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...
متن کاملDesign Methods for Maximum Minimum-Distance Error-Correcting Codes
In error-correcting codes for combating noisy transmission channels, a central concept i s the notion of minimum distance. If a code can be constructed with minimum distance between code points of 2m-k 1 I then any number of errors per code word which does not exceed m can be corrected, thus increasing the reliability of transmission above that to be expected with no redundancy i n the code. An...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Mathematics and Mathematical Sciences
سال: 2003
ISSN: 0161-1712,1687-0425
DOI: 10.1155/s0161171203204063